Dichotomy result on 3-regular bipartite non-negative functions
نویسندگان
چکیده
We prove a complexity dichotomy theorem for class of Holant problems on 3-regular bipartite graphs. Given an arbitrary nonnegative weighted symmetric constraint function f=[x0,x1,x2,x3], we that the problem Holant(f|(=3)) is either computable in polynomial time or #P-hard. The criterion f explicit.
منابع مشابه
Sampling 3-colourings of regular bipartite graphs
We show that if Σ = (V,E) is a regular bipartite graph for which the expansion of subsets of a single parity of V is reasonably good and which satisfies a certain local condition (that the union of the neighbourhoods of adjacent vertices does not contain too many pairwise nonadjacent vertices), and if M is a Markov chain on the set of proper 3-colourings of Σ which updates the colour of at most...
متن کامل3 Negative result measurements in mesoscopic systems
We investigate measurement of electron transport in quantum dot systems by using single-electron transistor as a noninvasive detector. It is demonstrated that such a detector can operate in the " negative-result measurement " regime. In this case the measured current is not distorted, providing that it is a non-coherent one. For a coherent transport, however, the possibility of observing a part...
متن کاملConstructions of Bipartite and Bipartite-regular Hypermaps
A hypermap is bipartite if its set of flags can be divided into two parts A and B so that both A and B are the union of vertices, and consecutive vertices around an edge or a face are contained in alternate parts. A bipartite hypermap is bipartiteregular if its set of automorphisms is transitive on A and on B. In this paper we see some properties of the constructions of bipartite hypermaps desc...
متن کاملAsymptotic Behavior of the Random 3-Regular Bipartite Graph
In 2001, two numerical experiments were performed to observe whether or not the second largest eigenvalue of the adjacency matrix for the random cubic bipartite graph approaches 2 √ 2 as the size of the graph increases. In the first experiment, by Kevin Chang, the graphs were chosen using an algorithm that constructed entirely new graphs at each step using three random permutations, in contrast...
متن کاملLocally 3-Arc-Transitive Regular Covers of Complete Bipartite Graphs
In this paper, locally 3-arc-transitive regular covers of complete bipartite graphs are studied, and results are obtained that apply to arbitrary covering transformation groups. In particular, methods are obtained for classifying the locally 3-arctransitive graphs with a prescribed covering transformation group, and these results are applied to classify the locally 3-arc-transitive regular cove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2023
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2023.113745